package com.example.leetcode.tree;

/*
// Definition for a Node.
class Node {
    public int val;
    public List<Node> children;

    public Node() {}

    public Node(int _val) {
        val = _val;
    }

    public Node(int _val, List<Node> _children) {
        val = _val;
        children = _children;
    }
};
*/

import com.example.leetcode.tree.common.Node;
import com.example.leetcode.tree.common.TreeUtils;

class Solution559 {
    public int maxDepth(Node root) {
        return TreeUtils.maxDepth(root);

    }
}

public class leetcode559 {
    public static void main(String[] args) {
        Solution559 solution559 = new Solution559();
        solution559.maxDepth(new Node(1));
    }
}
